The Bulgarian Solitaire and the Mathematics around It
نویسنده
چکیده
The Bulgarian solitaire is a mathematical card game played by one person. A pack of n cards is divided into several decks (or “piles”). Each move consists of the removing of one card from each deck and collecting the removed cards to form a new deck. The game ends when the same position occurs twice. It has turned out that when n = k(k + 1)/2 is a triangular number, the game reaches the same stable configuration with size of the piles 1, 2, . . . , k. The purpose of the paper is to tell the (quite amusing) story of the game and to discuss mathematical problems related with the Bulgarian solitaire. Dedicated to the memory of Borislav Bojanov (1944–2009), a great mathematician, person, and friend.
منابع مشابه
A note on random Bulgarian solitaire
We consider a stochastic variant of the game of Bulgarian solitaire [9]. For the stationary measure of the random Bulgarian solitaire, we prove that most of its mass is concentrated on (roughly) triangular configurations of certain type.
متن کاملRandom Bulgarian solitaire
We consider a stochastic variant of the game of Bulgarian solitaire [9]. For the stationary measure of the random Bulgarian solitaire, we prove that most of its mass is concentrated on (roughly) triangular configurations of certain type.
متن کاملSome Physicochemical Characteristics of Fish Products Sampled from Bulgarian Retail Markets
Background: The quality and safety of fish products is determined by chemical, physical, and microbiological parameters, important for satisfying consumers’ requirements. Also, the freshness of fish is essential for evaluation of its quality. On the Bulgarian retail market, fish is commonly offered chilled, frozen, or processed. The purpose of this study was to determine some physicochemi...
متن کاملShift-Induced Dynamical Systems on Partitions and Compositions
The rules of “Bulgarian solitaire” are considered as an operation on the set of partitions to induce a finite dynamical system. We focus on partitions with no preimage under this operation, known as Garden of Eden points, and their relation to the partitions that are in cycles. These are the partitions of interest, as we show that starting from the Garden of Eden points leads through the entire...
متن کاملThe Cycling of Partitions and Compositions under Repeated Shifts
In “Bulgarian Solitaire”, a player divides a deck of n cards into piles. Each move consists of taking a card from each pile to form a single new pile. One is concerned only with how many piles there are of each size. Starting from any division into piles, one always reaches some cycle of partitions of n. Brandt proved that for n = 1+2+ · · ·+k, the cycle is just the single partition into piles ...
متن کامل